Enumeration of the Hamiltonian Walks on a Cubic Sublattice
نویسندگان
چکیده
Vijay S. Pande†, Alexander Yu. Grosberg †‡, Chris Joerg§, Toyoichi Tanaka† †Department of Physics and Center for Materials Science and Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA ‡On leave from: Institute of Chemical Physics, Russian Academy of Sciences, Moscow 117977, Russia §Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA
منابع مشابه
Enumeration of cubic lattice walks by contact class
Self-avoiding walks on a three-dimensional ~3D! simple cubic lattice are often used to model polymers, especially proteins. The Hamiltonian is generally taken to be a function of contacts between sequentially nonadjacent residues. The set of all conformations having a particular set of contacts occupies the same energy level, and one would like to estimate the degeneracy or chain entropy of the...
متن کاملExact enumeration of Hamiltonian circuits, walks, and chains in two and three dimensions
We present an algorithm for enumerating exactly the number of Hamiltonian chains on regular lattices in low dimensions. By definition, these are sets of k disjoint paths whose union visits each lattice vertex exactly once. The well-known Hamiltonian circuits and walks appear as the special cases k = 0 and k = 1 respectively. In two dimensions, we enumerate chains on L × L square lattices up to ...
متن کاملExact enumeration of three-dimensional lattice proteins
We present an algorithm for the exhaustive enumeration of all monomer sequences and conformations of short lattice proteins as described by the hydrophobic–polar (HP) model. The algorithm is used for an exact identification of all designing sequences of HP proteins consisting of up to 19 monomers whose conformations are represented by interacting self–avoiding walks on the simple cubic lattice....
متن کاملSelf-avoiding walk enumeration via the lace expansion
We introduce a new method for the enumeration of self-avoiding walks based on the lace expansion. We also introduce an algorithmic improvement, called the two-step method, for self-avoiding walk enumeration problems. We obtain significant extensions of existing series on the cubic and hypercubic lattices in all dimensions d ≥ 3: we enumerate 32-step self-avoiding polygons in d = 3, 26-step self...
متن کاملExact results for Hamiltonian walks from the solution of the fully packed loop model on the honeycomb lattice.
We derive the nested Bethe Ansatz solution of the fully packed O(n) loop model on the honeycomb lattice. From this solution we derive the bulk free energy per site along with the central charge and geometric scaling dimensions describing the critical behaviour. In the n = 0 limit we obtain the exact compact exponents γ = 1 and ν = 1/2 for Hamiltonian walks, along with the exact value κ2 = 3 √ 3...
متن کامل